一类具有阶段结构和时滞的捕食系统的持续生存和稳定性

我们提出和研究一类带有阶段结构和时滞的捕食模型,得到了种群持续生存的充分条件.研究了阶段结构和时滞对系统稳定性的影响,获得了系统发生Hopf分支和稳定性的条件以及轨道渐进稳定的周期解的存在性.     

Electron-confined LO-phonon scattering in GaAs-Al0.45Ga0.55As superlattice

We develop a theoretical model to the scattering time due to the electron-confined LO-phonon in GaAs-Al_xGa_1-xAs superlattice taking into account the sub-band parabolicity. Using the new analytic wave function of electron miniband conduction of superlattice and a reformulation slab model for the confined LO-phonon modes, an expression for the electron-confined LO-phonon scattering time is obtained. In solving numerically a partial differential equation for the phonon generation rate, our results show that forx = 0.45, the LO-phonon in superlattice changes from a bulk-like propagating mode to a confined mode. The dispersion of the relaxation time due to the emission of confined LO-phonons depends strongly on the total energy.     

丙烯腈γ辐射聚合的NMR研究

用¹H NMR、¹³C NMR谱、自旋-晶格弛豫时间（T₁）和自旋-自旋弛豫时间（T₂）研究了丙烯腈在⁶⁰Co γ射线辐射聚合后的大分子结构变化与大分子链的运动. 结果表明随着辐射剂量增大，在单体形成聚合物的过程中，聚合物主链上出现了少量的-OH基团，继续增大辐射剂量， -OH部分被氧化. 对聚合物溶液的变温氢谱的研究表明，溶剂中的残余水与上述-OH形成氢键，且随着温度升高氢键被破坏，同时H₂O与-OH之间还存在着质子交换. 利用¹³C NMR谱对丙烯腈辐射聚合的产物进行了序列结构分析. 对T₁和T₂的研究表明，辐射剂量的增大并未影响到聚丙烯腈的链运动，证明了在丙烯腈的辐射聚合过程交联反应未发生.     

TDI线扫相机光学通道建模与仿真

卫星相机建模与仿真研究不论在民用还是军事领域都具有重要的理论研究和实际应用价值。根据TDI线扫相机的工作原理建立了一个TDI线扫相机光学通道的数学模型,该模型包括从景物到TDI CCD离散图像的几何投影关系和能量传递关系两部分,对于确定的成像系统,给定景物参数和光学系统参数,就可以确定对应图像传感器上的离散图像。为了验证模型,对一幅卫星图像进行了计算机仿真。建立的模型可以用来研究当成像条件改变时对图像的影响,进一步还可以用来发展虚拟卫星相机系统。     

KNSBN晶体猫式互抽动相位共轭光特性

在KNSBN：Ce晶体中，利用二波耦合作用，在单一光束无法获得相位共轭光的条件下，实现了“猫”式互抽运相位共轭光输出，获得较高的共轭光发射率，实验结果表明，晶体的二波耦合作用可以使晶体的自抽运相位共轭光的阈值光强降低。入射光的入射角范围增大，响应时间缩短。     

交流源作用下介观RLC电路系统量子态随时间的演化

根据量子不变量理论，同时考虑介观电容器极板间电子波函数的耦合作用和电路的耗散,研究介观RLC电路系统在交流电流源作用下动力学的演化过程，并且得到描述系统量子态随时间的演化算符.进一步的分析结果表明，介观RLC电路系统的波函数将由任意的初态演化到一般的压缩态. 关键词： 介观RLC电路 交变电源 不变量理论 时间演化算符     

安全质量费用工期在网络计划中的系统优化研究

施工网络计划中安全、质量、费用、工期达到综合优化是工程管理决策追求的目标,在工程项目管理中对这4个指标进行全面系统分析,并且进行综合均衡优化,对于提高工程项目的综合效益至关重要.采取在网络计划所有可行的施工方案中寻求最优的方案组合,从而达到总目标的优化.并且通过一个实例来说明本方法的应用.     

On the Erlang Loss Model with Time Dependent Input

We consider the M(t)/M(t)/m/m queue, where the arrival rate λ(t) and service rate μ(t) are arbitrary (smooth) functions of time. Letting p_n(t) be the probability that n servers are occupied at time t (0≤ n≤ m, t > 0), we study this distribution asymptotically, for m→∞ with a comparably large arrival rate λ(t) = O(m) (with μ(t) = O(1)). We use singular perturbation techniques to solve the forward equation for p_n(t) asymptotically. Particular attention is paid to computing the mean number of occupied servers and the blocking probability p_m(t). The analysis involves several different space-time ranges, as well as different initial conditions (we assume that at t = 0 exactly n₀ servers are occupied, 0≤ n₀≤ m). Numerical studies back up the asymptotic analysis. AMS subject classification: 60K25,34E10 Supported in part by NSF grants DMS-99-71656 and DMS-02-02815     

Persistence and stability for a two-species ratio-dependent predator-prey system with distributed time delay

A two-species ratio-dependent predator-prey model with distributed time delay is investigated. It is shown that the system is persistent under some appropriate conditions, and sufficient conditions are obtained for both the local and global stability of the positive equilibrium of the system.     

Online weighted flow time and deadline scheduling

In this paper we study some aspects of weighted flow time. We first show that the online algorithm Highest Density First is an O(1)-speed O(1)-approximation algorithm for P|r_i,pmtn|∑w_iF_i. We then consider a related Deadline Scheduling Problem that involves minimizing the weight of the jobs unfinished by some unknown deadline D on a uniprocessor. We show that any c-competitive online algorithm for weighted flow time must also be c-competitive for deadline scheduling. We then give an O(1)-competitive algorithm for deadline scheduling.